Decomposition de Km+Kn en cycles hamiltoniens

Recouvrements Hamiltoniens de certains graphes

We study the possibility of covering some graphs with Hamiltonian chains. The results are applied to the particular case of the divisorial graph to give some new answers to a question asked by P. Erdös. © 2005 Elsevier Ltd. All rights reserved.

Sur la frequence de leptospirose en Iran

Sur la fréquence de leptospirose en Iran

Existence de la brucellose en Iran. Isolement de Brucella abortus

Hamilton Cycle Decomposition of the Butterfly Network

in this paper, we prove that the wrapped Butterfly graph WBF(d; n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2. Key-words: Butterfly graph, graph theory, Hamiltonism, Hamilton decomposition, Hamilton cycle, Hamilton circuit, perfect matching. (Résumé : tsvp) This work has been supported by the C...